Optimal Multiplicative Generalized Linear Search Plan for a Discrete Random Walker
نویسندگان
چکیده
منابع مشابه
Optimal Finite-time Control of Positive Linear Discrete-time Systems
This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...
متن کاملPSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...
متن کاملOPTIMAL DESIGN OF DIAGRID MODULES BY PSEUDO RANDOM DIRECTIONAL SEARCH
The present work reveals a problem formulation to minimize material consumption and improve efficiency of diagrids to resist equivalent wind loading. The integrated formulation includes not only sizing of structural members but also variation in geometry and topology of such a system. Particular encoding technique is offered to handle practical variation of diagrid modules. A variant of Pseudo-...
متن کاملA Novel Adaptive Cuckoo Search for Optimal Query Plan Generation
The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization ...
متن کاملGlobal optimization of a generalized linear multiplicative program
In this paper a solution algorithm for a class of generalized linear multiplicative programs having a polyhedral feasible region is proposed. The algorithm is based on the so called optimal level solutions method. Some optimality conditions are used to improve the performance of the proposed algorithm. Results of a computational test are provided.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization
سال: 2013
ISSN: 2314-6486
DOI: 10.1155/2013/706176